On the Characterization of Dennis, El-Alem, and Maciel's Class of Trust-Region Algorithms
نویسندگان
چکیده
In a recent paper, Dennis, El-Alem, and Maciel suggested a class of trust-region-based algorithms for solving the equality constrained optimization problem. They proved global convergence for the class. In this paper, we characterize this class and present a short, straightforward, and self-contained global convergence theory. The results are stronger than Dennis, El-Alem, and Maciel's results.
منابع مشابه
A Global Convergence Theory for a General Class ofTrust - Region - Based Algorithms for Constrained OptimizationWithout Assuming Regularity
This work presents a convergence theory for a general class of trust-region-based algorithms for solving the smooth nonlinear programming problem with equality constraints. The results are proved under very mild conditions on the quasi-normal and tangential components of the trial steps. The Lagrange multiplier estimates and the Hessian estimates are assumed to be bounded. In addition, the regu...
متن کاملOn the Convergence Theory of Trust-Region-Based Algorithms for Equality-Constrained Optimization
In a recent paper, Dennis, El{Alem, and Maciel proved global convergence to a stationary point for a general trust{region{based algorithm for equality{constrained optimization. This general algorithm is based on appropriate choices of trust{region subproblems and seems particularly suitable for large problems. This paper shows global convergence to a point satisfying the second{order necessary ...
متن کاملAnalysis of Inexact Trust-Region SQP Algorithms
In this paper we study the global convergence behavior of a class of composite–step trust–region SQP methods that allow inexact problem information. The inexact problem information can result from iterative linear systems solves within the trust–region SQP method or from approximations of first–order derivatives. Accuracy requirements in our trust– region SQP methods are adjusted based on feasi...
متن کاملA Global Convergence Theory for General Trust-Region-Based Algorithms for Equality Constrained Optimization
This work presents a global convergence theory for a broad class of trust-region algorithms for the smooth nonlinear programming problem with equality constraints. The main result generalizes Powell's 1975 result for unconstrained trust-region algorithms. The trial step is characterized by very mild conditions on its normal and tangential components. The normal component need not be computed ac...
متن کاملA New Strategy for Choosing the Radius Adjusting Parameters in Trust Region Methods
Trust region methods are a class of important and efficient methods for solving unconstrained optimization problems. The efficiency of these methods strongly depends on the initial parameter, especially radius adjusting parameters. In this paper, we propose a new strategy for choosing the radius adjusting parameters. Numerical results from testing the new idea to solve a class of unconstrained ...
متن کامل